Orthogonal Matching Pursuit: A Brownian Motion Analysis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved RIP Analysis of Orthogonal Matching Pursuit

Orthogonal Matching Pursuit (OMP) has long been considered a powerful heuristic for attacking compressive sensing problems; however, its theoretical development is, unfortunately, somewhat lacking. This paper presents an improved Restricted Isometry Property (RIP) based performance guarantee for -sparse signal reconstruction that asymptotically approaches the conjectured lower bound given in Da...

متن کامل

Tuning Free Orthogonal Matching Pursuit

Orthogonal matching pursuit (OMP) is a widely used compressive sensing (CS) algorithm for recovering sparse signals in noisy linear regression models. The performance of OMP depends on its stopping criteria (SC). SC for OMP discussed in literature typically assumes knowledge of either the sparsity of the signal to be estimated k0 or noise variance σ , both of which are unavailable in many pract...

متن کامل

Orthogonal Matching Pursuit with Replacement

In this paper, we consider the problem of compressed sensing where the goal is to recover all sparsevectors using a small number of fixed linear measurements. For this problem, we propose a novelpartial hard-thresholding operator that leads to a general family of iterative algorithms. While oneextreme of the family yields well known hard thresholding algorithms like ITI and HTP[17, ...

متن کامل

Orthogonal Matching Pursuit from Noisy Measurements: A New Analysis∗

A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover a k-sparse n-dimensional real vector from m = 4k log(n) noise-free linear measurements obtained through a random Gaussian measurement matrix with a probability that approaches one as n → ∞. This work strengthens this result by showing that a lower number of measurements, m = 2k log(n − k), is in ...

متن کامل

A remark about orthogonal matching pursuit algorithm

In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give (p, q) instance optimality for a large class of encoders with 1 ≤ p ≤ q ≤ 2 and (p, q) 6= (2, 2). We also show that, if the encoding matrix is drawn from an appropriate distribution, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2012

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2011.2176936